On the greatest prime factor of integers
نویسندگان
چکیده
Let N be a positive integer and let A and B be dense subsets of {1, . . . , N}. The purpose of this paper is to establish a good lower bound for the greatest prime factor of ab+ 1 as a and b run over the elements of A and B respectively. 1991 AMS Mathematics Subject Classification. Primary 11N30, Secondary 11L05, keywords: greatest prime factor, Selberg’s sieve, Kloosterman sums.
منابع مشابه
On Prime Factors of Integers of the Form ab +
1. If n is a positive integer, p is a prime number and k is a non-negative integer with p | n, p n then we write p‖n. For n > 1 let p(n) and P (n) denote the least and greatest prime factor of n, respectively. In the last 15 years many papers have been written on the arithmetical properties of elements of sum sets A + B (defined as the set of the integers of the form a + b with a ∈ A, b ∈ B) wh...
متن کاملAlmost Perfect Powers in Consecutive Integers (ii)
Let k 4 be an integer. We find all integers of the form by where l 2 and the greatest prime factor of b is at most k (i.e. nearly a perfect power) such that they are also products of k consecutive integers with two terms omitted.
متن کاملOn the Number of Prime Factors of a Finite
contributions to Catalan's classical problem to show that 8,9 is the only pair of consecutive positive integers which are both perfect powers. The work of Professor Ko and the related work by others show that there is just one mathematical world and that there are no borders in this world. For any positive integer n let P (n); !(n); (n) denote the greatest prime factor of n, the number of disti...
متن کاملON THE GREATEST PRIME FACTOR OF (ab+ 1)(ac+ 1)
We prove that for integers a > b > c > 0, the greatest prime factor of (ab+1)(ac+1) tends to infinity with a. In particular, this settles a conjecture raised by Györy, Sarkozy and Stewart, predicting the same conclusion for the product (ab + 1)(ac + 1)(bc + 1). In the paper [GSS], Gÿory, Sarkozy and Stewart conjectured that, for positive integers a > b > c, the greatest prime factor of the prod...
متن کاملUpper bounds on the solutions to n = p+m^2
ardy and Littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. They believed that the number $mathcal{R}(n)$ of such representations for $n = p+m^2$ is asymptotically given by begin{equation*} mathcal{R}(n) sim frac{sqrt{n}}{log n}prod_{p=3}^{infty}left(1-frac{1}{p-1}left(frac{n}{p}right)right), end{equation*} where $p$ is a prime, $m$ is a...
متن کامل